Chained Vector Simplex

Chained Boosting

We describe a method to learn to make sequential stopping decisions, such as those made along a processing pipeline. We envision a scenario in which a series of decisions must be made as to whether to continue to process. Further processing costs time and resources, but may add value. Our goal is to create, based on historic data, a series of decision rules (one at each stage in the pipeline) t...

Chained Linear Equating

On Chained Cryptographic Puzzles

Cryptographic puzzles provide an elegant solution in combating denial of services attacks. In this paper we introduce the concept of chained cryptographic puzzle. We define two kinds of chained puzzle constructions: linearly chained puzzles and randomly chained puzzles. The first construction prove to be very useful in some scenarios, from which the more general is in which a client may choose ...

On Cryptographic Chained Puzzles

Cryptographic puzzles provide an elegant solution in combating denial of services attacks. In this paper we introduce the concept of chained puzzles and we define two kinds of chained puzzles: linearly chained puzzles and randomly chained puzzles. These construnstions prove to be very useful in some scenarios, from which the more general is in which a client may choose to solve only some of the...

Chained Gaussian Processes

Gaussian process models are flexible, Bayesian non-parametric approaches to regression. Properties of multivariate Gaussians mean that they can be combined linearly in the manner of additive models and via a link function (like in generalized linear models) to handle non-Gaussian data. However, the link function formalism is restrictive, link functions are always invertible and must convert a p...

A parametric simplex algorithm for linear vector optimization problems

In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (Evans-Steuer) algorithm [12]. Different from it, the proposed algorithm works in the parameter space and does not aim to find the set of all efficient solutions. Instead, it finds a solution in the sense of Lö...